16. Modifications to Graph Partitioning Tools for use with FETI methods
نویسندگان
چکیده
منابع مشابه
Partitioning Algorithms for Simultaneously Balancing Iterative and Direct Methods
This paper focuses on domain decomposition-based numerical simulations whose subproblems corresponding to the various subdomains are solved using sparse direct factorization methods (e.g., FETI). Effective load-balancing of such computations requires that the resulting partitioning simultaneously balances the amount of time required to factor the local subproblem using direct factorization, and...
متن کاملMechanism Free Domain Decomposition
The simulation of three dimensional structural dynamics on massively parallel platforms places stringent requirements on the existing software infrastructure. A constrained and nonlinear graph partitioning problem that arises in scalable iterative substructuring methods, such as FETI methods, is identified. New sufficient criteria on a partition are presented that ensure the applicability of FE...
متن کاملAnalysis of FETI methods for multiscale PDEs. Part II: interface variation
In this article we give a new rigorous condition number estimate of the finite element tearing and interconnecting (FETI) method and a variant thereof, all-floating FETI. We consider the scalar elliptic equation in a twoor three-dimensional domain with a highly heterogeneous (multiscale) diffusion coefficient. This coefficient is allowed to have large jumps not only across but also along subdom...
متن کاملJOHANNES KEPLER UNIVERSITY LINZ Institute of Computational Mathematics Analysis of FETI Methods for Multiscale PDEs - Part II: Interface Variation
In this article we give a new rigorous condition number estimate of the finite element tearing and interconnecting (FETI) method and a variant thereof, all-floating FETI. We consider the scalar elliptic equation in a twoor three-dimensional domain with a highly heterogeneous (multiscale) diffusion coefficient. This coefficient is allowed to have large jumps not only across but also along subdom...
متن کاملGeneration of Balanced Subdomain Clusters with Minimum Interface for Distributed Domain Decomposition Applications
Balancing and dual Domain Decomposition Methods (DDMs) are used in practice on parallel computing environments with the number of generated subdomains being generally larger than the number of available processors. The present study describes partitioning concepts used to: (a) generate subdomains for such DDMs and (b) organize these subdomains into subdomain clusters, in order to assign each cl...
متن کامل